منابع مشابه
Fuzzy Time Series Forecasting Based On K-Means Clustering
Many forecasting models based on the concepts of Fuzzy time series have been proposed in the past decades. These models have been widely applied to various problem domains, especially in dealing with forecasting problems in which historical data are linguistic values. In this paper, we present a new fuzzy time series forecasting model, which uses the historical data as the universe of discourse...
متن کاملOutlier Detection using Improved Genetic K-means
The outlier detection problem in some cases is similar to the classification problem. For example, the main concern of clustering-based outlier detection algorithms is to find clusters and outliers, which are often regarded as noise that should be removed in order to make more reliable clustering. In this article, we present an algorithm that provides outlier detection and data clustering simul...
متن کاملImproved and Simplified Inapproximability for k-means
The k-means problem consists of finding k centers in R that minimize the sum of the squared distances of all points in an input set P from R to their closest respective center. Awasthi et. al. recently showed that there exists a constant ε′ > 0 such that it is NP-hard to approximate the k-means objective within a factor of 1 + ε′. We establish that the constant ε′ is at least 0.0013. For a give...
متن کاملAn Improved K-Means with Artificial Bee Colony Algorithm for Clustering Crimes
Crime detection is one of the major issues in the field of criminology. In fact, criminology includes knowing the details of a crime and its intangible relations with the offender. In spite of the enormous amount of data on offenses and offenders, and the complex and intangible semantic relationships between this information, criminology has become one of the most important areas in the field o...
متن کاملApproximate K-Means++ in Sublinear Time
The quality of K-Means clustering is extremely sensitive to proper initialization. The classic remedy is to apply k-means++ to obtain an initial set of centers that is provably competitive with the optimal solution. Unfortunately, k-means++ requires k full passes over the data which limits its applicability to massive datasets. We address this problem by proposing a simple and efficient seeding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Advanced Computational Science with Applications
سال: 2019
ISSN: 2196-2499
DOI: 10.5899/2019/cacsa-00094